Age Matching Patterns and Search
نویسندگان
چکیده
This paper considers a marriage market with two-sided search and transferable utility in which the match payoff depends on age. It characterizes a set of payoff functions consistent with two salient marriage age patterns, (1) assortative matching by age, and (2) “differential age matching”, a formalization of the age difference at marriage between men and women. Some simple conditions on slope and curvature of the payoff function in partners’ ages are shown to achieve both, whereas supermodularity is not necessary for positive assortative matching, and in fact many common supermodular functions lead to negative sorting. (JEL C78, D83, J64) I would like to thank Ricardo Lagos and Debraj Ray for their advice and support, and Itay Fainmesser, Pietro Ortoleva, Lones Smith, and participants of the NRET seminar at NYU and of the NASMES conference 2011 for very helpful comments and suggestions. All errors are mine.
منابع مشابه
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملProductivity Investment and Labor Force Participation in Search Equilibrium
The present paper contributes to the theoretical analysis of the human capital investment and participation decision of heterogeneous workers in the search and matching framework. Its aim is to characterize the equilibrium and to identify the efficiency. Here, the paper studies search equilibrium and matching to consider the participation decision of heterogeneous workers who have differen...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملSemantic processing survey of spoken and written words in adolescents with cerebral palsy: Evidence from PALPA word-picture matching test
Objective: The present study aimed to assess and compare semantic processing of spoken and written words in adolescents with cerebral palsy and healthy adolescents. Method: The present study is quantitative in terms of type and experimental in terms of method. Examination Group consisted 30 adolescents with cerebral palsy aged 10 to 15 years were selected by convenience sampling method. All of ...
متن کاملGeneric Search Plans for Matching Advanced Graph Patterns
In the current paper, we present search plans which can guide pattern matching for advanced graph patterns with edge identities, containment constraints, type variables, negative application conditions, attribute conditions, and injectivity constraints. Based on a generic search graph representation, all search plan operations (e.g. checking the existence of an edge, or extending a matching can...
متن کامل